#include <iostream>
using namespace std;
const int N = 1000000;
long long dp[N];//记录每次的结果，备忘录数组
long long fib(int n)
{ 
    if (dp[n])
        return dp[n];
    if (n <= 2)
        return 1;
    else
        return dp[n] = (fib(n - 1) + fib(n - 2));
}
int main()
{
    int n = 0;
    cin >> n;
    for (int i = 1; i < n; i++)
    {
        cout << fib(i) << endl;
    }
        return 0;
}